Multilevel Threshold Secret and Function Sharing based on the Chinese Remainder Theorem

A recent work of Harn and Fuyou presents the first multilevel (disjunctive) threshold secret sharing scheme based on the Chinese Remainder Theorem. In this work, we first show that the proposed method is not secure and also fails to work with a certain natural setting of the threshold values on compartments. We then propose a secure scheme that works for all threshold settings. In this scheme, we employ a refined version of Asmuth-Bloom secret sharing with a special and generic Asmuth-Bloom sequence called the {\it anchor sequence}. Based on this idea, we also propose the first multilevel conjunctive threshold secret sharing scheme based on the Chinese Remainder Theorem. Lastly, we discuss how the proposed schemes can be used for multilevel threshold function sharing by employing it in a threshold RSA cryptosystem as an example

Bazı genelleştirilmiş çokpartili erişim yapıları.

In this work, we study some generalized multipartite access structures and linear secret sharing schemes for their realizations. Given a multipartite set of participants with m compartments (or levels) and m conditions to be satisfied by an authorized set, we firstly examine the intermediary access structures arousing from the natural case concerning that any c out of m of these conditions suffice, instead of requiring anyone or all of the m conditions simultaneously, yielding to generalizations for both the compartmented and hierarchical cases. These are realized essentially by employing a series of Lagrange interpolations and a simple frequently-used connective tool called access structure product, as well as some known constructions for existing ideal schemes. The resulting schemes are non-ideal but perfect. We also consider nested multipartite access structures, where we let a compartment to be defined within another, so that the access structure is composed of some multipartite substructures. We extend formerly employed bivariate interpolation techniques to multivariate interpolation, in order to realize such access structures. The generic scheme we consider is perfect with a high probability such as 1-O(1/q) on a finite field F_q. In particular, we propose a non-nested generalization for the conventional compartmented access structures, which depicts a stronger way of controlling the additional participants.Ph.D. - Doctoral Progra

Seeking a Chaotic Order in the Cryptocurrency Market

In this study, we investigate the existence of chaos in the global cryptocurrency market. Specifically, we analyze parameters of chaotic order, nonlinearity, sensitivity to the initial conditions, monofractality, and multifractality. For this purpose, we conduct a comprehensive series of tests, including Brock–Dechert–Scheinkman (BDS) test, largest Lyapunov exponent, box-counting, and monogram analysis for fractal dimension, and multiple tests for long-range dependence (Aggregated Variances, Peng, Higuchi, R/S Analysis, and Multifractal Detrended Fluctuation Analysis (MFDFA)). All tests are performed over a variety of major cryptocurrencies: Bitcoin, Litecoin, Ethereum, and Ripple. The empirical results support the existence of chaos in the cryptocurrency market. Accordingly, cryptocurrency returns are not random and follow a chaotic order. Therefore, long term predictions are not possible, contrary to most of the discussions ongoing in the media and the public